package ink.lovejinhu.leetcode;

/**
 * @author jinhu
 * created 2021-07-27 11:30
 */
public class Solution_0748 {
    public String shortestCompletingWord(String licensePlate, String[] words) {
        String res = null;
        for (int i = 0; i < words.length; i++) {

        }
        return null;
    }

    public boolean ifContain(String word, String licensePlate) {

        return false;
    }
}
